Termination w.r.t. Q of the following Term Rewriting System could be proven:

Q restricted rewrite system:
The TRS R consists of the following rules:

flatten1(nil) -> nil
flatten1(unit1(x)) -> flatten1(x)
flatten1(++2(x, y)) -> ++2(flatten1(x), flatten1(y))
flatten1(++2(unit1(x), y)) -> ++2(flatten1(x), flatten1(y))
flatten1(flatten1(x)) -> flatten1(x)
rev1(nil) -> nil
rev1(unit1(x)) -> unit1(x)
rev1(++2(x, y)) -> ++2(rev1(y), rev1(x))
rev1(rev1(x)) -> x
++2(x, nil) -> x
++2(nil, y) -> y
++2(++2(x, y), z) -> ++2(x, ++2(y, z))

Q is empty.


↳ QTRS
  ↳ DependencyPairsProof

Q restricted rewrite system:
The TRS R consists of the following rules:

flatten1(nil) -> nil
flatten1(unit1(x)) -> flatten1(x)
flatten1(++2(x, y)) -> ++2(flatten1(x), flatten1(y))
flatten1(++2(unit1(x), y)) -> ++2(flatten1(x), flatten1(y))
flatten1(flatten1(x)) -> flatten1(x)
rev1(nil) -> nil
rev1(unit1(x)) -> unit1(x)
rev1(++2(x, y)) -> ++2(rev1(y), rev1(x))
rev1(rev1(x)) -> x
++2(x, nil) -> x
++2(nil, y) -> y
++2(++2(x, y), z) -> ++2(x, ++2(y, z))

Q is empty.

Using Dependency Pairs [1,13] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:

FLATTEN1(++2(x, y)) -> FLATTEN1(x)
REV1(++2(x, y)) -> REV1(x)
REV1(++2(x, y)) -> REV1(y)
FLATTEN1(++2(x, y)) -> FLATTEN1(y)
FLATTEN1(++2(unit1(x), y)) -> FLATTEN1(y)
FLATTEN1(++2(unit1(x), y)) -> FLATTEN1(x)
++12(++2(x, y), z) -> ++12(x, ++2(y, z))
FLATTEN1(++2(x, y)) -> ++12(flatten1(x), flatten1(y))
REV1(++2(x, y)) -> ++12(rev1(y), rev1(x))
FLATTEN1(++2(unit1(x), y)) -> ++12(flatten1(x), flatten1(y))
FLATTEN1(unit1(x)) -> FLATTEN1(x)
++12(++2(x, y), z) -> ++12(y, z)

The TRS R consists of the following rules:

flatten1(nil) -> nil
flatten1(unit1(x)) -> flatten1(x)
flatten1(++2(x, y)) -> ++2(flatten1(x), flatten1(y))
flatten1(++2(unit1(x), y)) -> ++2(flatten1(x), flatten1(y))
flatten1(flatten1(x)) -> flatten1(x)
rev1(nil) -> nil
rev1(unit1(x)) -> unit1(x)
rev1(++2(x, y)) -> ++2(rev1(y), rev1(x))
rev1(rev1(x)) -> x
++2(x, nil) -> x
++2(nil, y) -> y
++2(++2(x, y), z) -> ++2(x, ++2(y, z))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof

Q DP problem:
The TRS P consists of the following rules:

FLATTEN1(++2(x, y)) -> FLATTEN1(x)
REV1(++2(x, y)) -> REV1(x)
REV1(++2(x, y)) -> REV1(y)
FLATTEN1(++2(x, y)) -> FLATTEN1(y)
FLATTEN1(++2(unit1(x), y)) -> FLATTEN1(y)
FLATTEN1(++2(unit1(x), y)) -> FLATTEN1(x)
++12(++2(x, y), z) -> ++12(x, ++2(y, z))
FLATTEN1(++2(x, y)) -> ++12(flatten1(x), flatten1(y))
REV1(++2(x, y)) -> ++12(rev1(y), rev1(x))
FLATTEN1(++2(unit1(x), y)) -> ++12(flatten1(x), flatten1(y))
FLATTEN1(unit1(x)) -> FLATTEN1(x)
++12(++2(x, y), z) -> ++12(y, z)

The TRS R consists of the following rules:

flatten1(nil) -> nil
flatten1(unit1(x)) -> flatten1(x)
flatten1(++2(x, y)) -> ++2(flatten1(x), flatten1(y))
flatten1(++2(unit1(x), y)) -> ++2(flatten1(x), flatten1(y))
flatten1(flatten1(x)) -> flatten1(x)
rev1(nil) -> nil
rev1(unit1(x)) -> unit1(x)
rev1(++2(x, y)) -> ++2(rev1(y), rev1(x))
rev1(rev1(x)) -> x
++2(x, nil) -> x
++2(nil, y) -> y
++2(++2(x, y), z) -> ++2(x, ++2(y, z))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [13,14,18] contains 3 SCCs with 3 less nodes.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
            ↳ QDPOrderProof
          ↳ QDP
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

++12(++2(x, y), z) -> ++12(x, ++2(y, z))
++12(++2(x, y), z) -> ++12(y, z)

The TRS R consists of the following rules:

flatten1(nil) -> nil
flatten1(unit1(x)) -> flatten1(x)
flatten1(++2(x, y)) -> ++2(flatten1(x), flatten1(y))
flatten1(++2(unit1(x), y)) -> ++2(flatten1(x), flatten1(y))
flatten1(flatten1(x)) -> flatten1(x)
rev1(nil) -> nil
rev1(unit1(x)) -> unit1(x)
rev1(++2(x, y)) -> ++2(rev1(y), rev1(x))
rev1(rev1(x)) -> x
++2(x, nil) -> x
++2(nil, y) -> y
++2(++2(x, y), z) -> ++2(x, ++2(y, z))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].


The following pairs can be oriented strictly and are deleted.


++12(++2(x, y), z) -> ++12(x, ++2(y, z))
++12(++2(x, y), z) -> ++12(y, z)
The remaining pairs can at least be oriented weakly.
none
Used ordering: Polynomial Order [17,21] with Interpretation:

POL( ++12(x1, x2) ) = x1


POL( ++2(x1, x2) ) = x1 + x2 + 1



The following usable rules [14] were oriented: none



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
            ↳ QDPOrderProof
              ↳ QDP
                ↳ PisEmptyProof
          ↳ QDP
          ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

flatten1(nil) -> nil
flatten1(unit1(x)) -> flatten1(x)
flatten1(++2(x, y)) -> ++2(flatten1(x), flatten1(y))
flatten1(++2(unit1(x), y)) -> ++2(flatten1(x), flatten1(y))
flatten1(flatten1(x)) -> flatten1(x)
rev1(nil) -> nil
rev1(unit1(x)) -> unit1(x)
rev1(++2(x, y)) -> ++2(rev1(y), rev1(x))
rev1(rev1(x)) -> x
++2(x, nil) -> x
++2(nil, y) -> y
++2(++2(x, y), z) -> ++2(x, ++2(y, z))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
            ↳ QDPOrderProof
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

REV1(++2(x, y)) -> REV1(y)
REV1(++2(x, y)) -> REV1(x)

The TRS R consists of the following rules:

flatten1(nil) -> nil
flatten1(unit1(x)) -> flatten1(x)
flatten1(++2(x, y)) -> ++2(flatten1(x), flatten1(y))
flatten1(++2(unit1(x), y)) -> ++2(flatten1(x), flatten1(y))
flatten1(flatten1(x)) -> flatten1(x)
rev1(nil) -> nil
rev1(unit1(x)) -> unit1(x)
rev1(++2(x, y)) -> ++2(rev1(y), rev1(x))
rev1(rev1(x)) -> x
++2(x, nil) -> x
++2(nil, y) -> y
++2(++2(x, y), z) -> ++2(x, ++2(y, z))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].


The following pairs can be oriented strictly and are deleted.


REV1(++2(x, y)) -> REV1(y)
REV1(++2(x, y)) -> REV1(x)
The remaining pairs can at least be oriented weakly.
none
Used ordering: Polynomial Order [17,21] with Interpretation:

POL( REV1(x1) ) = x1


POL( ++2(x1, x2) ) = x1 + x2 + 1



The following usable rules [14] were oriented: none



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
            ↳ QDPOrderProof
              ↳ QDP
                ↳ PisEmptyProof
          ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

flatten1(nil) -> nil
flatten1(unit1(x)) -> flatten1(x)
flatten1(++2(x, y)) -> ++2(flatten1(x), flatten1(y))
flatten1(++2(unit1(x), y)) -> ++2(flatten1(x), flatten1(y))
flatten1(flatten1(x)) -> flatten1(x)
rev1(nil) -> nil
rev1(unit1(x)) -> unit1(x)
rev1(++2(x, y)) -> ++2(rev1(y), rev1(x))
rev1(rev1(x)) -> x
++2(x, nil) -> x
++2(nil, y) -> y
++2(++2(x, y), z) -> ++2(x, ++2(y, z))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
            ↳ QDPOrderProof

Q DP problem:
The TRS P consists of the following rules:

FLATTEN1(++2(x, y)) -> FLATTEN1(x)
FLATTEN1(++2(x, y)) -> FLATTEN1(y)
FLATTEN1(++2(unit1(x), y)) -> FLATTEN1(y)
FLATTEN1(++2(unit1(x), y)) -> FLATTEN1(x)
FLATTEN1(unit1(x)) -> FLATTEN1(x)

The TRS R consists of the following rules:

flatten1(nil) -> nil
flatten1(unit1(x)) -> flatten1(x)
flatten1(++2(x, y)) -> ++2(flatten1(x), flatten1(y))
flatten1(++2(unit1(x), y)) -> ++2(flatten1(x), flatten1(y))
flatten1(flatten1(x)) -> flatten1(x)
rev1(nil) -> nil
rev1(unit1(x)) -> unit1(x)
rev1(++2(x, y)) -> ++2(rev1(y), rev1(x))
rev1(rev1(x)) -> x
++2(x, nil) -> x
++2(nil, y) -> y
++2(++2(x, y), z) -> ++2(x, ++2(y, z))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].


The following pairs can be oriented strictly and are deleted.


FLATTEN1(++2(x, y)) -> FLATTEN1(x)
FLATTEN1(++2(x, y)) -> FLATTEN1(y)
FLATTEN1(++2(unit1(x), y)) -> FLATTEN1(y)
FLATTEN1(++2(unit1(x), y)) -> FLATTEN1(x)
The remaining pairs can at least be oriented weakly.

FLATTEN1(unit1(x)) -> FLATTEN1(x)
Used ordering: Polynomial Order [17,21] with Interpretation:

POL( FLATTEN1(x1) ) = x1


POL( ++2(x1, x2) ) = x1 + x2 + 1


POL( unit1(x1) ) = x1



The following usable rules [14] were oriented: none



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
            ↳ QDPOrderProof
              ↳ QDP
                ↳ QDPOrderProof

Q DP problem:
The TRS P consists of the following rules:

FLATTEN1(unit1(x)) -> FLATTEN1(x)

The TRS R consists of the following rules:

flatten1(nil) -> nil
flatten1(unit1(x)) -> flatten1(x)
flatten1(++2(x, y)) -> ++2(flatten1(x), flatten1(y))
flatten1(++2(unit1(x), y)) -> ++2(flatten1(x), flatten1(y))
flatten1(flatten1(x)) -> flatten1(x)
rev1(nil) -> nil
rev1(unit1(x)) -> unit1(x)
rev1(++2(x, y)) -> ++2(rev1(y), rev1(x))
rev1(rev1(x)) -> x
++2(x, nil) -> x
++2(nil, y) -> y
++2(++2(x, y), z) -> ++2(x, ++2(y, z))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].


The following pairs can be oriented strictly and are deleted.


FLATTEN1(unit1(x)) -> FLATTEN1(x)
The remaining pairs can at least be oriented weakly.
none
Used ordering: Polynomial Order [17,21] with Interpretation:

POL( FLATTEN1(x1) ) = x1


POL( unit1(x1) ) = x1 + 1



The following usable rules [14] were oriented: none



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
            ↳ QDPOrderProof
              ↳ QDP
                ↳ QDPOrderProof
                  ↳ QDP
                    ↳ PisEmptyProof

Q DP problem:
P is empty.
The TRS R consists of the following rules:

flatten1(nil) -> nil
flatten1(unit1(x)) -> flatten1(x)
flatten1(++2(x, y)) -> ++2(flatten1(x), flatten1(y))
flatten1(++2(unit1(x), y)) -> ++2(flatten1(x), flatten1(y))
flatten1(flatten1(x)) -> flatten1(x)
rev1(nil) -> nil
rev1(unit1(x)) -> unit1(x)
rev1(++2(x, y)) -> ++2(rev1(y), rev1(x))
rev1(rev1(x)) -> x
++2(x, nil) -> x
++2(nil, y) -> y
++2(++2(x, y), z) -> ++2(x, ++2(y, z))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.